-
1 primitive recursive term
Математика: примитивно рекурсивный терминУниверсальный англо-русский словарь > primitive recursive term
-
2 primitive recursive term
English-Russian scientific dictionary > primitive recursive term
-
3 term
1) термин2) мат. член; терм3) элемент; составляющая4) срок5) условие (напр. контракта)6) мат. одночлен•- n-th term of expansion - totally labeled term -
4 term scheme
labeling scheme — схема маркировки; схема расстановки меток
-
5 примитивно-рекурсивный член
Русско-английский научно-технический словарь Масловского > примитивно-рекурсивный член
-
6 примитивно рекурсивный термин
Mathematics: primitive recursive termУниверсальный русско-английский словарь > примитивно рекурсивный термин
-
7 expansion
1) протяженность; пространство2) метал. развальцовка3) матем. разложение ( в ряд)4) растяжение; расширение; распространение; экспансия5) геол. увеличение мощности пласта•expansion by binomial theorem — матем. разложение по формуле бинома
expansion by continuity — матем. расширение по непрерывности
expansion by heat — физ. расширение при нагревании
expansion into a series — матем. разложение в ряд
expansion in terms of — разложение в ряд по...
См. также в других словарях:
Primitive recursive function — The primitive recursive functions are defined using primitive recursion and composition as central operations and are a strict subset of the recursive functions (recursive functions are also known as computable functions). The term was coined by… … Wikipedia
Super-recursive algorithm — In computer science and computability theory, super recursive algorithms are algorithms that are more powerful, that is, compute more, than Turing machines. The term was introduced by Mark Burgin, whose book Super recursive algorithms develops… … Wikipedia
History of the Church–Turing thesis — This article is an extension of the history of the Church–Turing thesis. The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
Algorithm characterizations — The word algorithm does not have a generally accepted definition. Researchers are actively working in formalizing this term. This article will present some of the characterizations of the notion of algorithm in more detail. This article is a… … Wikipedia
History of the Church-Turing thesis — This article is an extension of the history of the Church Turing thesis.The debate and discovery of the meaning of computation and recursion has been long and contentious. This article provides detail of that debate and discovery from Peano s… … Wikipedia
μ operator — In computability theory, the μ operator, minimization operator, or unbounded search operator searches for the least natural number with a given property. Contents 1 Definition 2 Properties 3 Examples … Wikipedia
metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… … Universalium
Ackermann function — In recursion theory, the Ackermann function or Ackermann Péter function is a simple example of a general recursive function that is not primitive recursive. General recursive functions are also known as computable functions. The set of primitive… … Wikipedia
mathematics, foundations of — Scientific inquiry into the nature of mathematical theories and the scope of mathematical methods. It began with Euclid s Elements as an inquiry into the logical and philosophical basis of mathematics in essence, whether the axioms of any system… … Universalium
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia